A Monotonicity Property for Weighted Delaunay Triangulations
نویسنده
چکیده
where i is the linear interpolation of f over the triangle Ti in T and the sum is over all triangles in the triangulation. One may consider changing the triangulation by exchanging two triangles joined by an edge, forming a quadrilateral, by the triangles obtained by switching the diagonal of the quadrilateral; this is called an edge ip or a 2 ! 2 bistellar ip. He showed that the roughness of a triangulation decreases when an edge is ipped to make the edge Delaunay. Since every triangulation can be transformed into a Delaunay triangulation by a sequence of edge ips, this implies that the roughness is minimized by a Delaunay triangulation. The roughness is equal to the following functional, which we call the Dirichlet energy: E (f; T ) = 1
منابع مشابه
A Variational Principle for Weighted Delaunay Triangulations and Hyperideal Polyhedra
We use a variational principle to prove an existence and uniqueness theorem for planar weighted Delaunay triangulations (with non-intersecting site-circles) with prescribed combinatorial type and circle intersection angles. Such weighted Delaunay triangulations may be interpreted as images of hyperbolic polyhedra with one vertex on and the remaining vertices beyond the infinite boundary of hype...
متن کاملPerturbations for Delaunay and weighted Delaunay 3D triangulations
The Delaunay triangulation and the weighted Delaunay triangulation are not uniquely defined when the input set is degenerate. We present a new symbolic perturbation that allows to always define these triangulations in a unique way, as soon as the points are not all coplanar. No flat tetrahedron exists in the defined triangulation. The perturbation scheme is easy to code; It is implemented in cg...
متن کاملGeneral-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of user-specified domains, they have “nicely shaped” triangles that optimize several criteria, and they are easy to construct and update. The present work generalizes constrained Delaunay triangulations (CDTs) to higher dimensions, a...
متن کاملOn Delaunay Oriented Matroids for Convex Distance Functions
For any nite point set S in Ed, an oriented matroid DOM(S) can be de ned in terms of how S is partitioned by Euclidean hyperspheres. This oriented matroid is related to the Delaunay triangulation of S and is realizable, because of the lifting property of Delaunay triangulations. We prove that the same construction of a Delaunay oriented matroid can be performed with respect to any smooth, stric...
متن کاملVector Weighted Anisotropic Voronoi Diagrams and Delaunay Traingulations
We introduce a weighting scheme for Voronoi diagrams that has preferred directions. This generalizes the concept of weighted Delaunay triangulations and overcomes some of the difficulties of using multiplicative anisotropic weight systems. We discuss properties that make these weighting schemes attractive.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 38 شماره
صفحات -
تاریخ انتشار 2007